A worm algorithm for random spatial permutations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spatial Random Permutations and Infinite Cycles

We consider systems of spatial random permutations, where permutations are weighed according to the point locations. Infinite cycles are present at high densities. The critical density is given by an exact expression. We discuss the relation between the model of spatial permutations and the ideal and interacting quantum Bose gas.

متن کامل

Lecture notes on Spatial Random Permutations

These notes accompany a sequence of lectures given at the Warsaw Probability Summer School on Spatial Random Permutations. Topics include random uniform and Ewens permutations, the interchange model and its analysis on the complete graph and on trees, a continuum model for spatial random permutations in Rd related to the Feynman-Kac representation of the ideal Bose gas and a discussion of model...

متن کامل

Spatial Random Permutations with Small Cycle Weights

We consider the distribution of cycles in two models of random permutations, that are related to one another. In the first model, cycles receive a weight that depends on their length. The second model deals with permutations of points in the space and there is an additional weight that involves the length of permutation jumps. We prove the occurrence of infinite macroscopic cycles above a certa...

متن کامل

Random Walks and Random Permutations

A connection is made between the random turns model of vicious walkers and random permutations indexed by their increasing subsequences. Consequently the scaled distribution of the maximum displacements in a particular asymmeteric version of the model can be determined to be the same as the scaled distribution of the eigenvalues at the soft edge of the GUE. The scaling of the distribution gives...

متن کامل

Symmetrized random permutations

Selecting N random points in a unit square corresponds to selecting a random permutation. Placing symmetry restrictions on the points, we obtain special kinds of permutations : involutions, signed permutations and signed involutions. We are interested in the statistics of the length (in numbers of points) of the longest up/right path in each symmetry type as the number of points increases to in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physics Procedia

سال: 2010

ISSN: 1875-3892

DOI: 10.1016/j.phpro.2010.08.009